Shortest Paths in an Arrangement with k Line Orientations
نویسندگان
چکیده
Suppose one has a line arrangement in which many lines are parallel, so that the number of diierent line orientations is k, and one wants to nd a shortest path from one point on a line in the arrangement to another such point. Using known techniques one can nd the shortest path in time and space O(n 2). We present an algorithm that can nd the shortest path in time and space O(n + k 2).
منابع مشابه
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the arrangement consists of two intersecting pencils (sets of lines where all intersect in a point), and the path endpoints are at opposite corners of the largest quadrilateral formed. The open problem was to find a shortest...
متن کاملOn shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectured. This gives a linear-time algorithm for computing shortest paths in such arrangements.
متن کاملAcyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)
In this paper we extend some of the computational results presented in 6] on the determination of an acyclic orientation of a graph which minimizes the maximum number of changes of orientations along the paths connecting a given subset of source-destination couples. The corresponding value is called the rank of the set of paths, and besides its theoretical interest has also practical applicatio...
متن کاملFinitely-Oriented Shortest Paths in the Presence of Polygonal Obstacles
Given a set of non-intersecting simple polygons, a set of points in the plane, and a set of xed orientations, we compute a graph such that for any two input points there exists a shortest path in G whose length equals the length of a shortest path between these points in the plane that does not intersect any polygon and that consists only of line segments of the given orientations. This graph m...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999